Efficient numerical evaluation of weak restricted compositions
نویسندگان
چکیده
We propose an algorithm to calculate the number of weak compositions, wherein each part is restricted a different range integers. This performs orders approximation up exact solution by using Inclusion-Exclusion Principle. The great advantage it with respect classical generating function technique that calculation exponentially faster as size numbers involved increases.
منابع مشابه
Generalized Algorithm for Restricted Weak Composition Generation - Generation Algorithm for Second-Order Restricted Weak Compositions
This paper presents a new algorithm that arrives at a generalized solution for the generation of restricted weak compositions of n-parts. In particular, this generalized algorithm covers many commonly sought compositions such as bounded compositions, restricted compositions, weak compositions, and restricted part compositions. Introduced is an algorithm for generating generalized types of restr...
متن کاملS-Restricted Compositions Revisited
An S-restricted composition of a positive integer n is an ordered partition of n where each summand is drawn from a given subset S of positive integers. There are various problems regarding such compositions which have received attention in recent years. This paper is an attempt at finding a closed-form formula for the number of S-restricted compositions of n. To do so, we reduce the problem to...
متن کاملLocally Restricted Compositions I. Restricted Adjacent Differences
We study compositions of the integer n in which the first part, successive differences, and the last part are constrained to lie in prescribed sets L,D,R, respectively. A simple condition on D guarantees that the generating function f(x,L,D,R) has only a simple pole on its circle of convergence and this at r(D), a function independent of L and R. Thus the number of compositions is asymptotic to...
متن کاملCompositions of pattern restricted sets of permutations
The composition of two pattern restricted classes X,Y is the set of all permutation products θφ where θ ∈ X,φ ∈ Y . This set is also defined by pattern restrictions. Examples are given where this set of restrictions is finite and where it is infinite. The composition operation is studied in terms of machines that sort and generate permutations. The theory is then applied to a multistage sorting...
متن کاملPart-products of S-restricted Integer Compositions
If S is a cofinite set of positive integers, an “S-restricted composition of n” is a sequence of elements of S, denoted ~λ = (λ1, λ2, . . . ), whose sum is n. For uniform random S-restricted compositions, the random variable B(~λ) = ∏ i λi is asymptotically lognormal. (A precise statement of the theorem includes an error term to bound the rate of convergence.) The proof is based upon a combinat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nereis
سال: 2023
ISSN: ['1888-8550', '2531-2545']
DOI: https://doi.org/10.46583/nereis_2022.1.1018